Distributed causal memory: modular specification and verification in higher-order distributed separation logic

نویسندگان

چکیده

We present the first specification and verification of an implementation a causally-consistent distributed database that supports modular full functional correctness properties clients servers. specify reason about in Aneris, higher-order separation logic for ML-like programming language with network primitives systems. demonstrate our specifications are useful, by proving small, but tricky, synthetic examples involving causal dependency verifying session manager library implemented on top database. use Aneris's facilities to obtain highly development, where each component is verified isolation, relying only (not implementations) other components. have used Coq formalization Aneris formalize all results presented paper proof assistant.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Mechanical Verification of Distributed Algorithms in Higher-Order Logic

The only practical way to verify the correctness of distributed algorithms with a high degree of conndence is to construct machine-checked, formal correctness proofs. In this paper we explain how to do so using HOL|an interactive proof assistant for higher-order logic developed by Gordon and others 18]. First, we describe how to build an infrastructure in HOL that supports reasoning about distr...

متن کامل

Distributed Contingency Logic and Security

In information security, ignorance is not bliss. It is always stated that hiding the protocols (let the other be ignorant about it) does not increase the security of organizations. However, there are cases that ignorance creates protocols. In this paper, we propose distributed contingency logic, a proper extension of contingency (ignorance) logic. Intuitively, a formula is distributed contingen...

متن کامل

Modular Specification and Verification of Dependable Distributed Protocols

In this paper, a framework utilizing constructs from category theory for compositional specification of dependable distributed protocols has been proposed. The paper shows how by defining external interfaces of basic modules, and functional mappings linking two different modules, a larger or more complex protocol can be composed and verified. To illustrate the proposed approach, the composition...

متن کامل

Specification-based Verification in a Distributed Shared Memory Simulation Model

The emergence of chip multiprocessors is leading to rapid advances in hardware and software systems to provide distributed shared memory (DSM) programming models, so-called DSM systems. A DSM system provides programming advantages within a scalable and cost-effective hardware solution. This benefit derives from the fact that a DSM system creates a shared-memory abstraction on top of a distribut...

متن کامل

Distributed Verification of Modular Systems

The use of distributed or parallel processing gained interest in the recent years to fight the state space explosion problem. Many industrial systems are described with large models, and the state space being even larger, it does not fit completely into the memory of a single computer. To avoid the high space requirement, several reduction techniques have been proposed: modular verification, pa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the ACM on programming languages

سال: 2021

ISSN: ['2475-1421']

DOI: https://doi.org/10.1145/3434323